Prior, initial state, and MCMC moves for allopolyploid networks
نویسنده
چکیده
Suppose there are d diploids and m tetraploids. In the language of [2], there are m models h = 1, h = 2, . . . h = m, where h is the number of hybridizations. Each model has a different number of parameters. Let W be the network topology and node times. The conditional priors π(W |h) must be comparable for different values of h in order to calculate the correct acceptance ratios when jumping between models. Ideally we would like to integrate out the parameters in W analytically, ie calculate for each h the value of ∫ π(W |h)dW
منابع مشابه
Bayesian Inference of Regulatory influence on Expression (biRte)
Expression levels of mRNA is regulated by different processes, comprising inhibition or activation by transcription factors (TF) and post-transcriptional degradation by microRNAs (miRNA). biRte (Bayesian Inference of Regulatory influence on Expression (biRte)) uses the regulatory networks of TFs and miRNAs together with mRNA and miRNA expression data to infer the influence of regulators on mRNA...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملJoint Bayesian Inference of miRNA and Transcription Factor Activities
Expression levels of mRNA molecules are regulated by different processes, comprising inhibition or activation by transcription factors (TF) and post-transcriptional degradation by microRNAs (miRNA). birta (Bayesian Inference of Regulation of Transcriptional Activity) uses the regulatory networks of TFs and miRNAs together with mRNA and miRNA expression data to infer switches of regulatory activ...
متن کاملBayesian CART – Prior Specification and Posterior Simulation –
We present advances in Bayesian modeling and computation for CART (classification and regression tree) models. The modeling innovations include a formal prior distributional structure for tree generation – the pinball prior – that allows for the combination of an explicit specification of a distribution for both the tree size and the tree shape. The core computational innovations involve a nove...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کامل